Error Correcting Code Bch
نویسندگان
چکیده
VLSI Architectures for Modern Error-Correcting Codes CRC Press Book. Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) codes, and binary. An important class of multipleerror-correcting linear cyclic codes is the class of BCH codes. In fact, BCH code is a generalization of the cyclic Hamming codes. Error correction codes (ECCs) are deployed in digital communication systems to tion 4 recalls the basics of BCH error correcting codes (ECC). Section 4.2.
منابع مشابه
Reliable MLC NAND Flash Memoris Based on Nonlinear t-Error-Correcting Codes
Multi-level cell (MLC) NAND flash memories are very popular storage media because of their power efficiency and big storage capacity. This paper proposes to use nonlinear t-error-correcting codes to replace linear BCH codes for error detection and correction in MLC NAND flash memories. Compared to linear BCH codes with the same bit-error correcting capability t, the proposed codes have the adva...
متن کاملNew Families of Triple Error Correcting Codes with BCH Parameters
Discovered by Bose, Chaudhuri and Hocquenghem [1], [4], the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being corrected is small relative to the code length. In this article we consider binary codes with minimum distance of 7. We construct new families of codes w...
متن کاملThe Second Generalized Hamming Weight of the Dual Codes of Double-error Correcting Binary Bch-codes
In this note we determine the second generalized Hamming weight of the dual codes of binary doubleerror correcting BCH-codes.
متن کاملError-correcting codes and Bh-sequences
We construct error-correcting (nonlinear) binary codes using a construction of Bose and Chowla in additive number theory. Our method extends a construction of Graham and Sloane for constant weight codes. The new codes improve 1028 of the 7168 best known h-error correcting codes of wordlength ≤ 512 with 1 ≤ h ≤ 14. We give asymptotical comparisons to shortened BCH codes.
متن کاملA triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
Based on a sufficient condition proposed by Hollmann and Xiang forconstructing triple-error-correcting codes, the minimum distance of a binary cycliccodeC1,3,13 with three zeros α, α3, and α13 of length 2−1 and the weight divisibilityof its dual code are studied, where m ≥ 5 is odd and α is a primitive element of thefinite field F2m . The codeC1,3,13 is proven to hav...
متن کامل